Renting a Cloud

We consider the problem of efficiently scheduling jobs on data centers to minimize the cost of renting machines from “the cloud.” In the most basic cloud service model, cloud providers offer computers on demand from large pools installed in data centers. Clients pay for use at an hourly rate. In order to minimize cost, each client needs to decide on the number of machines to be rented and the duration of renting each machine. This suggests the following optimization problem, which we call Rent Minimization. There is a set J = {j1, j2, . . . , jn} of n jobs. Job ji is released at time ri ≥ 0, has a deadline of di, and requires pi > 0 contiguous processing time, ri, di, pi ∈ R. The jobs need to be scheduled on identical parallel machines. Machines may be rented for any length of time; however, the cost of renting a machine for ` ≥ 0 time units is d`/De dollars, for some given large real D; in particular, one pays $2 whether the machine is rented for D + 1 or 2D time units. The goal is to schedule all the jobs in a way that minimizes the incurred rental cost. In this paper, we develop offline and online algorithms for Rent Minimization problem. The algorithms achieve a constant factor approximation for the offline version and O(log pmax pmin ) for the online version, where pmax and pmin are the maximum and minimum processing time of the jobs respectively. We also show that no deterministic online algorithm can achieve an approximation factor better than log3 pmax pmin within a constant factor. Both of these algorithms use the wellstudied problem of Machine Minimization as a subroutine. Machine Minimization is a special case of Rent Minimization where D = maxi di. In the process of solving the Rent Minimization problem, in this paper, we also develop the first online algorithm for Machine Minimization. 1998 ACM Subject Classification F.2 Analysis of Algorithms and Problem Complexity, F.2.2 Nonnumerical Algorithms and Problems, F.1.2 Modes of Computation